Non-bisimulation-based Markovian behavioral equivalences

نویسنده

  • Marco Bernardo
چکیده

The behavioral equivalence that is typically used to relate Markovian process terms and to reduce their underlying state spaces is Markovian bisimilarity. One of the reasons is that Markovian bisimilarity is consistent with ordinary lumping. The latter is an aggregation for Markov chains that is exact, hence it guarantees the preservation of the performance characteristics across Markovian bisimilar process terms. In this paper we show that two non-bisimulation-based Markovian behavioral equivalences – Markovian testing equivalence and Markovian trace equivalence – induce at the Markov chain level an aggregation strictly coarser than ordinary lumping that is still exact. We then show that only Markovian testing equivalence may constitute a useful alternative to Markovian bisimilarity, as it turns out to be a congruence with respect to the typical process algebraic operators, while Markovian trace equivalence is not a congruence with respect to parallel composition.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Modal Logic Characterization of Markovian Testing and Trace Equivalences

Markovian testing and trace equivalences have been recently proposed as reasonable alternatives to Markovian bisimilarity, as both of them induce at the Markov chain level an aggregation strictly coarser than ordinary lumping that is still exact. In this paper we provide a modal logic characterization for each of the two non-bisimulation-based Markovian behavioral equivalences, which relies on ...

متن کامل

Markovian Testing and Trace Equivalences Exactly Lump More Than Markovian Bisimilarity

The notion of equivalence that is typically used to relate Markovian process terms and to reduce their underlying state spaces is Markovian bisimilarity. The reason is that, besides being a congruence, Markovian bisimilarity is consistent with ordinary lumping, an exact aggregation for Markov chains. In this paper we show that two non-bisimulation-based Markovian behavioral equivalences – Marko...

متن کامل

A survey of modal logics characterising behavioural equivalences for non-deterministic and stochastic systems

Behavioral equivalences are a means to establish whether computing systems possess the same properties. The specific set of properties that are preserved by a specific behavioral equivalence clearly depends on how the system behavior is observed and can usually be characterized by means of a modal logic. In this paper we consider three different approaches to the definition of behavioral equiva...

متن کامل

Towards State Space Reduction Based on T-Lumpability-Consistent Relations

Markovian behavioral equivalences can be exploited for state space reduction before performance evaluation takes place. It is known that Markovian bisimilarity corresponds to ordinary lumpability and that Markovian testing and trace equivalences correspond to a coarser exact relation we call T-lumpability. While there exists an ordinarylumpability-consistent aggregation algorithm, this is not t...

متن کامل

A Survey of Markovian Behavioral Equivalences

Markovian behavioral equivalences are a means to relate and manipulate the formal descriptions of systems with an underlying CTMC semantics. There are three fundamental approaches to their definition: bisimilarity, testing, and trace. In this paper we survey the major results appeared in the literature about Markovian bisimilarity, Markovian testing equivalence, and Markovian trace equivalence....

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • J. Log. Algebr. Program.

دوره 72  شماره 

صفحات  -

تاریخ انتشار 2007